Despacho económico de unidades com funções de custo não convexas usando enxames

Dissertação para obtenção do grau de Mestre em Engenharia Electrotécnica Ramo de Energia

An effortless hybrid method to solve economic load dispatch problem in power systems

This paper proposes a new approach and coding scheme for solving economic dispatch problems (ED) in power systems through an effortless hybrid method (EHM). This novel coding scheme can effectively prevent futile searching and also prevents obtaining infeasible solutions through the application of stochastic search methods, consequently dramatically improves search efficiency and solution quality. The dominant constraint of an economic dispatch problem is power balance. The operational constraints, such as generation limitations, ramp rate limits, prohibited operating zones (POZ), network loss are considered for practical operation. Firstly, in the EHM procedure, the output of generator is obtained with a lambda iteration method and without considering POZ and later in a genetic based algorithm this constraint is satisfied. To demonstrate its efficiency, feasibility and fastness, the EHM algorithm was applied to solve constrained ED problems of power systems with 6 and 15 units. The simulation results obtained from the EHM were compared to those achieved from previous literature in terms of solution quality and computational efficiency. Results reveal that the superiority of this method in both aspects of financial and CPU time. (C) 2011 Elsevier Ltd. All rights reserved.

An unproblematic method to solve economic and emission dispatch

This paper proposes a method to determine the output of all online units with minimum total cost when the amount of emission is reasonable. A joint economic and emission dispatch is proposed in order to get a significant compromise between costs and emission such that real power supply-demand equilibrium is satisfied. In order to have a meaningful compromise between costs and emission in the problem formulation, two variables are used, weighting factor and price penalty factor. A case study comprising of a 3-unit power system is employed, where various demand is used. Results for the test system indicate the fastness and effectiveness of proposed method. © 2011 IEEE.

Improving the convergence rate of the inverse iteration method

Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration method exhibits slow convergence for some eigenproblems. In this paper, a modified inverse iteration algorithm is presented for improving the convergence rate. At every iteration, an optimal linear combination of the latest and the preceding iteration vectors is used as the input vector for the next iteration. The effectiveness of the proposed algorithm is demonstrated for three typical eigenproblems, i.e. eigenproblems with distinct, close and repeated eigenvalues. The algorithm yields 29, 96 and 23% savings in computational time, respectively, for these problems. The algorithm is simple and easy to implement, and this renders the algorithm even more attractive.

Iteration of closed geodesics in stationary Lorentzian manifolds

Following the lines of Bott in (Commun Pure Appl Math 9:171-206, 1956), we study the Morse index of the iterates of a closed geodesic in stationary Lorentzian manifolds, or, more generally, of a closed Lorentzian geodesic that admits a timelike periodic Jacobi field. Given one such closed geodesic gamma, we prove the existence of a locally constant integer valued map Lambda(gamma) on the unit circle with the property that the Morse index of the iterated gamma(N) is equal, up to a correction term epsilon(gamma) is an element of {0,1}, to the sum of the values of Lambda(gamma) at the N-th roots of unity. The discontinuities of Lambda(gamma) occur at a finite number of points of the unit circle, that are special eigenvalues of the linearized Poincare map of gamma. We discuss some applications of the theory.

Efficient solution of multiple cracks in great number using eigen COD boundary integral equations with iteration procedure

A newly developed computational approach is proposed in the paper for the analysis of multiple crack problems based on the eigen crack opening displacement (COD) boundary integral equations. The eigen COD particularly refers to a crack in an infinite domain under fictitious traction acting on the crack surface. With the concept of eigen COD, the multiple cracks in great number can be solved by using the conventional displacement discontinuity boundary integral equations in an iterative fashion with a small size of system matrix to determine all the unknown CODs step by step. To deal with the interactions among cracks for multiple crack problems, all cracks in the problem are divided into two groups, namely the adjacent group and the far-field group, according to the distance to the current crack in consideration. The adjacent group contains cracks with relatively small distances but strong effects to the current crack, while the others, the cracks of far-field group are composed of those with relatively large distances. Correspondingly, the eigen COD of the current crack is computed in two parts. The first part is computed by using the fictitious tractions of adjacent cracks via the local Eshelby matrix derived from the traction boundary integral equations in discretized form, while the second part is computed by using those of far-field cracks so that the high computational efficiency can be achieved in the proposed approach. The numerical results of the proposed approach are compared not only with those using the dual boundary integral equations (D-BIE) and the BIE with numerical Green's functions (NGF) but also with those of the analytical solutions in literature. The effectiveness and the efficiency of the proposed approach is verified. Numerical examples are provided for the stress intensity factors of cracks, up to several thousands in number, in both the finite and infinite plates.

Artefact and iteration : circular entanglements

In this workshop proposal I discuss a case study physical computing environment named Talk2Me. This work was exhibited in February 2006 at The Block, Brisbane as an interactive installation in the early stages of its development. The major artefact in this work is a 10 metre wide X 3 metre high light-permeable white dome. There are other technologies and artefacts contained within the dome that make up this interactive environment. The dome artefact has impacted heavily on the design process, including shaping the types of interactions involved, the kinds of technologies employed, and the choice of other artefacts. In this workshop paper, I chart some of the various iterations Talk2Me has undergone in the design process.

A Spectral Iteration Technique For The Analysis Of Yagi-Uda Arrays

The paper present a spectral iteration technique for the analysis of linear arrays of unequally spaced dipoles of unequal lengths. As an example, the Yagi-Uda array is considered for illustration. Analysis is carried out in both the spatial as well as the spectral domains, the two being linked by the Fourier transform. The fast Fourier transform algorithm is employed to obtain an iterative solution to the electric field integral equation and the need for matrix inversion is circumvented. This technique also provides a convenient means for testing the satisfaction of the boundary conditions on the array elements. Numerical comparison of the input impedance and radiation pattern have been made with results deduced elsewhere by other methods. The computational efficency of this technique has been found to be significant for large arrays.

An interpreter for slips-An applicative language based on LAMBDA-Calculus

An applicative language based on the LAMBDA-Calculus is presented. The language, SLIPS (Small Language for Instruction Purposes), is described using the LAMBDA-Calculus as a metalanguage. A call-by-need mechanism of function invocation eliminates the drawbacks of both call-by-name and call-by-value. The system has been implemented in PASCAL.

Velocity and acceleration analysis of complex mechanisms by graphical iteration

A simple graphical method is presented for velocity and acceleration analysis of complex mechanisms possessing low or high degree of complexity. The method is iterative in character and generally yields the solution within a few iterations. Several examples have been worked out to illustrate the method.

Phage lambda beta protein, a component of general recombination, is associated with host ribosomal S1 protein

We have purified phage lambda beta protein produced by a recombinant plasmid carrying bet gene and confirm that it forms a complex with a protein of relative molecular mass 70 kDa. Therefore, beta protein, a component of general genetic recombination, is associated with two functionally diverse complexes; one containing exonuclease and the other 70 kDa protein. Using a number of independent methods, we show that 70 kDa protein is the ribosomal S1 protein of E. coli. Further, the association of 70 kDa protein with beta protein is biologically significant, as the former inhibits joining of the terminal ends of lambda chromosome and renaturation of complementary single stranded DNA promoted by the latter. More importantly, these findings initiate an understanding of an important mode of host- virus interaction in general with specific implication(s) in homologous genetic recombination.

Formation of linear plasmid multimers promoted by the phage lambda Red-system in lon mutants of Escherichia coli

We report here the formation of plasmid linear multimers promoted by the Red-system of phage lambda using a multicopy plasmid comprised of lambda red alpha and red beta genes, under the control of the lambda cI857 repressor. Our observations have revealed that the multimerization of plasmid DNA is dependent on the red beta and recA genes, suggesting a concerted role for these functions in the formation of plasmid multimers. The formation of multimers occurred in a recBCD+ sbcB+ xthA+ lon genetic background at a higher frequency than in the isogenic lon+ host cells. The multimers comprised tandem repeats of monomer plasmid DNA. Treatment of purified plasmid DNA with exonuclease III revealed the presence of free double-chain ends in the molecules. Determination of the size of multimeric DNA, by pulse field gel electrophoresis, revealed that the bulk of the DNA was in the range 50-240 kb, representing approximately 5-24 unit lengths of monomeric plasmid DNA. We provide a conceptual framework for Red-system-promoted formation and enhanced accumulation of plasmid linear multimers in lon mutants of E. coli.

The homologous recombination system of phage lambda. Pairing activities of beta protein

The red genes of phage lambda specify two proteins, exonuclease and beta protein, which are essential for its general genetic recombination in recA- cells. These proteins seem to occur in vivo as an equimolar complex. In addition, beta protein forms a complex with another polypeptide, probably of phage origin, of Mr 70,000. The 70-kDa protein appears to be neither a precursor nor an aggregated form of either exonuclease or beta protein, since antibodies directed against the latter two proteins failed to react with 70-kDa protein on Ouchterlony double diffusion analysis. beta protein promotes Mg2+-dependent renaturation of complementary strands (Kmiec, E., and Holloman, W. K. (1981) J. Biol. Chem. 256, 12636-12639). To look for other pairing activities of beta protein, we developed methods of purification to free it of associated exonuclease. Exonuclease-free beta protein appeared unable to cause the pairing of a single strand with duplex DNA; however, like Escherichia coli single strand binding protein (SSB), beta protein stimulated formation of joint molecules by recA protein from linear duplex DNA and homologous circular single strands. Like recA protein, but unlike SSB, beta protein promoted the joining of the complementary single-stranded ends of phage lambda DNA. beta protein specifically protected single-stranded DNA from digestion by pancreatic DNase. The half-time for renaturation catalyzed by beta protein was independent of DNA concentration, unlike renaturation promoted by SSB and spontaneous renaturation, which are second order reactions. Thus, beta protein resembles recA protein in its ability to bring single-stranded DNA molecules together and resembles SSB in its ability to reduce secondary structure in single-stranded DNA.

Profiling k-Iteration Paths : A Generalization of the Ball-Larus Profiling Algorithm

The Ball-Larus path-profiling algorithm is an efficient technique to collect acyclic path frequencies of a program. However, longer paths -those extending across loop iterations - describe the runtime behaviour of programs better. We generalize the Ball-Larus profiling algorithm for profiling k-iteration paths - paths that can span up to to k iterations of a loop. We show that it is possible to number suchk-iteration paths perfectly, thus allowing for an efficient profiling algorithm for such longer paths. We also describe a scheme for mixed-mode profiling: profiling different parts of a procedure with different path lengths. Experimental results show that k-iteration profiling is realistic.